COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	\magnification\magstephalf
C00005 ENDMK
C⊗;
\magnification\magstephalf
\input macro.tex
\def\today{\ifcase\month\or
  January\or February\or March\or April\or May\or June\or
  July\or August\or September\or October\or November\or December\fi
  \space\number\day, \number\year}
\baselineskip 14pt
\rm
\font\rmn=cmr9
\line{\sevenrm a114.tex[106,phy] \today\hfill}

\bigskip
\line{\bf CS 106H\hfill Assignment}
\line{\bf Autumn 1986\hfill}

\bigskip
Everyone solved a simpler version of the $a↑3+b↑3=c↑3+d↑3$ problem, by
building in an assumption that none of the numbers had to be bigger than
some constant. The hard part of the problem is to program unbounded search,
and no one did the hard part, so here is an extra problem with the same hard
part.

Write a program containing a function {\tt F(X:REAL):REAL}. All you know
about the definition of~{\tt F} is that there is some range of~{\tt X},
(possibly very short and very remote, like {\tt 9999.97} to {\tt 9999.971}
where {\tt F(X)<0}. You must guarantee that your program will find such an~{\tt X}.
For your own testing, try
$$F(X)=(X-1.17)↑2-0.01\,.$$
%$$\hbox{F(X)=(X-1.17)$↑{\hbox{\tt 2}}$-0.01}\,.$$
When you have your program ready, we will give you the definition of~{\tt F}.


\bigskip
\line{\copyright 1986 Robert W. Floyd; 
First draft (not published) November 13, 1986\hfil}
%revised: Date; subsequently revised.\hfill}

\bye